0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n025.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:01:04 EDT 2025
0.12/0.34	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.s5aXQ0sGva/E---3.1_18785.p
0.20/0.50	# Version: 3.0.0-ho
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.50	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho12 with 240s (1) cores
0.20/0.50	# Starting new_bool_9 with 240s (1) cores
0.20/0.50	# Starting post_as_ho1 with 240s (1) cores
0.20/0.50	# Starting post_as_ho4 with 240s (1) cores
0.20/0.50	# Starting post_as_ho2 with 240s (1) cores
0.20/0.50	# Starting ehoh_best2_full_lfho with 240s (1) cores
0.20/0.50	# Starting full_lambda_10 with 240s (1) cores
0.20/0.50	# Starting new_ho_8 with 240s (1) cores
0.20/0.50	# post_as_ho12 with pid 18863 completed with status 0
0.20/0.50	# Result found by post_as_ho12
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.50	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho12 with 240s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HHUSF-FFSF11-SSSFFMBN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.20/0.50	# Starting ehoh_best_nonlift with 130s (1) cores
0.20/0.50	# ehoh_best_nonlift with pid 18871 completed with status 0
0.20/0.50	# Result found by ehoh_best_nonlift
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.50	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho12 with 240s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HHUSF-FFSF11-SSSFFMBN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.20/0.50	# Starting ehoh_best_nonlift with 130s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_23, type, esk1_0: $i).
0.20/0.50	thf(decl_24, type, esk2_0: $i).
0.20/0.50	thf(decl_25, type, esk3_1: ($i > $i > $o) > $i).
0.20/0.50	thf(cTHM47B, conjecture, ![X1:$i, X2:$i]:((((X1)=(X2))<=![X3:$i > $i > $o]:((![X4:$i]:((X3 @ X4 @ X4))=>(X3 @ X1 @ X2))))), file('/export/starexec/sandbox/tmp/tmp.s5aXQ0sGva/E---3.1_18785.p', cTHM47B)).
0.20/0.50	thf(c_0_1, negated_conjecture, ~(![X1:$i, X2:$i]:((![X3:$i > $i > $o]:((![X4:$i]:((X3 @ X4 @ X4))=>(X3 @ X1 @ X2)))=>((X1)=(X2))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM47B])])).
0.20/0.50	thf(c_0_2, negated_conjecture, ![X11:$i > $i > $o]:(((~(X11 @ (esk3_1 @ X11) @ (esk3_1 @ X11))|(X11 @ esk1_0 @ esk2_0))&((esk1_0)!=(esk2_0)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.20/0.50	thf(c_0_3, negated_conjecture, ![X3:$i > $i > $o]:(((X3 @ esk1_0 @ esk2_0)|~((X3 @ (esk3_1 @ X3) @ (esk3_1 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_4, negated_conjecture, ((esk1_0)!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_5, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_3]), c_0_4]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 1
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 2
0.20/0.50	# Removed in clause preprocessing      : 0
0.20/0.50	# Initial clauses in saturation        : 2
0.20/0.50	# Processed clauses                    : 4
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 0
0.20/0.50	# ...remaining for further processing  : 4
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 0
0.20/0.50	# Backward-rewritten                   : 0
0.20/0.50	# Generated clauses                    : 8
0.20/0.50	# ...of the previous two non-redundant : 2
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 0
0.20/0.50	# Paramodulations                      : 0
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Disequality decompositions           : 0
0.20/0.50	# Total rewrite steps                  : 0
0.20/0.50	# ...of those cached                   : 0
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 2
0.20/0.50	#    Positive orientable unit clauses  : 0
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 1
0.20/0.50	#    Non-unit-clauses                  : 1
0.20/0.50	# Current number of unprocessed clauses: 0
0.20/0.50	# ...number of literals in the above   : 0
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 2
0.20/0.50	# Clause-clause subsumption calls (NU) : 0
0.20/0.50	# Rec. Clause-clause subsumption calls : 0
0.20/0.50	# Non-unit clause-clause subsumptions  : 0
0.20/0.50	# Unit Clause-clause subsumption calls : 0
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 0
0.20/0.50	# BW rewrite match successes           : 0
0.20/0.50	# Condensation attempts                : 0
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 293
0.20/0.50	# Search garbage collected termcells   : 81
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.003 s
0.20/0.50	# System time              : 0.000 s
0.20/0.50	# Total time               : 0.003 s
0.20/0.50	# Maximum resident set size: 1756 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.004 s
0.20/0.50	# System time              : 0.003 s
0.20/0.50	# Total time               : 0.007 s
0.20/0.50	# Maximum resident set size: 1708 pages
0.20/0.50	% E exiting
0.20/0.50	% E exiting
0.20/0.50	EOF